raSAT: An SMT Solver for Polynomial Constraints
نویسندگان
چکیده
This paper presents the raSAT SMT solver for polynomial constraints, which aims to handle them over both reals and integers with simple unified methodologies: (1) raSAT loop for inequalities, which extends the interval constraint propagation with testing to accelerate SAT detection, and (2) a non-constructive reasoning for equations over reals, based on the generalized intermediate value theorem.
منابع مشابه
raSAT: SMT for Polynomial Inequality
This paper presents an iterative approximation refinement, called raSATloop, which solves a system of polynomial inequalities on real numbers. The approximation scheme consists of interval arithmetic (over-approximation, aiming to decide UNSAT) and testing (under-approximation, aiming to decide SAT). If both of them fail to decide, input intervals are refined by decomposition, a refinement step...
متن کاملComparing Different Projection Operators in the Cylindrical Algebraic Decomposition for SMT Solving
Satisfiability-modulo-theories (SMT) solving is a technique to check the satisfiability of logical formulas. In the context of SMT solving for non-linear real arithmetic, the cylindrical algebraic decomposition (CAD) can be embedded as a theory solver to solve sets (conjunctions) of polynomial constraints. When developing such a CAD theory solver, a design choice is given by the selection of th...
متن کاملComparing Different Projection Operators in Cylindrical Algebraic Decomposition for SMT Solving
Satisfiability-modulo-theories (SMT) solving is a technique to check the satisfiability of logical formulas. In the context of SMT solving for non-linear real arithmetic, the cylindrical algebraic decomposition (CAD) can be embedded as a theory solver to solve sets (conjunctions) of polynomial constraints. When developing such a CAD theory solver, a design choice is given by the selection of th...
متن کاملNorn: An SMT Solver for String Constraints
We present version 1.0 of the Norn SMT solver for string constraints. Norn is a solver for an expressive constraint language, including word equations, length constraints, and regular membership queries. As a feature distinguishing Norn from other SMT solvers, Norn is a decision procedure under the assumption of a set of acyclicity conditions on word equations, without any restrictions on the u...
متن کاملOn Gröbner Bases in the Context of Satisfiability-Modulo-Theories Solving over the Real Numbers
We address satisfiability checking for the first-order theory of the real-closed field (RCF) using satisfiability-modulo-theories (SMT) solving. SMT solvers combine a SAT solver to resolve the Boolean structure of a given formula with theory solvers to verify the consistency of sets of theory constraints. In this paper, we report on an integration of Gröbner bases as a theory solver so that it ...
متن کامل